Online Weighted Matching: Beating the $\frac{1}{2}$ Barrier
نویسنده
چکیده
We study the problem of online weighted bipartite matching in which we want to find a maximum weighted matching between two sets of entities, e.g. matching impressions in online media to advertisers. Karp et al. [14] designed the elegant algorithm Ranking with competitive ratio 1−1/e for the unweighted case. Without the commonly accepted Free Disposal assumption, it is easy to show that no competitive ratio can be achieved in the weighted case. However, under this assumption, it is not hard to show that algorithm Greedy is 1/2 competitive [17, 7], and this is tight for deterministic algorithms. After more than 25 years from the seminal work of Karp et al.[14], it is still an open question whether an online algorithm with competitive ratio better than 1/2 exists or not. We answer this question affirmatively by presenting randomized algorithm StochasticGreedy with competitive ratio greater than 0.501. We also optimize this algorithm and propose slightly changed algorithm OptimizedStochasticGreedy with competitive ratio greater than 0.5018. In light of the hardness result of Kapralov et al. [12] that restricts beating the 1/2-competitive ratio for Monotone Submodular Welfare Maximization problem, our result can be seen as an evidence that solving weighted matching problem is strictly easier than submodular welfare maximization in online settings. Free disposal assumption states that advertisers are either indifferent or happier if they receive more impressions than the capacities stated in their contracts. Advertiser a pays some fixed amount based on its contract to receive Ca (capacity of a) impressions. Assigning more impressions to a only makes it happier since the contract terms do not change and a will not pay more. We can also assume that each advertiser has capacity 1 since we can replace a with Ca identical copies each with capacity 1.
منابع مشابه
Online Bipartite Matching with Decomposable Weights
We study a weighted online bipartite matching problem: G(V1, V2, E) is a weighted bipartite graph where V1 is known beforehand and the vertices of V2 arrive online. The goal is to match vertices of V2 as they arrive to vertices in V1, so as to maximize the sum of weights of edges in the matching. If assignments to V1 cannot be changed, no bounded competitive ratio is achievable. We study the we...
متن کاملBeating Ratio 0.5 for Weighted Oblivious Matching Problems
We prove the first non-trivial performance ratios strictly above 0.5 for weighted versions of the oblivious matching problem. Even for the unweighted version, since Aronson, Dyer, Frieze, and Suen first proved a non-trivial ratio above 0.5 in the mid-1990s, during the next twenty years several attempts have been made to improve this ratio, until Chan, Chen, Wu and Zhao successfully achieved a s...
متن کاملDiffusion-weighted MR Imaging for the Assessment of Renal Function: Analysis Using Statistical Models Based on Truncated Gaussian and Gamma Distributions
PURPOSE To determine the appropriateness of statistical models using the truncated Gaussian distribution and gamma distribution for diffusion signal decay, and to assess the correlation between the parameters obtained from the statistical models and estimated glomerular filtration rate (eGFR). METHODS Twenty-nine patients with chronic kidney disease and 21 healthy volunteers were included and...
متن کاملA lazy approach to on-line bipartite matching
We present a new approach, called a lazy matching, to the problem of on-line matching on bipartite graphs. Originally, each arriving element is irrevocably matched with some already existing one. In this paper we allow matching a new element to a group of elements (possibly decreasing other groups) with additional restrictions that every two groups have to be disjoint and decreasing a group is ...
متن کاملOnline Matching for Scheduling Problems
In this work an alternative online variant of the matching problem in bipartite graphs is presented. It is motivated by a scheduling problem in an online environment. In such an environment, a task is unknown up to its disclosure. However, in that moment it is not necessary to take a decision on the service of that particular task. In reality, an online scheduler has to decide on how to use the...
متن کامل